A New Method for Improving Path Delay Fault Coverage
نویسنده
چکیده
In the test of a circuit for faults it is very desirable to have the minimum paths that are to be tested for a complete circuit test. At first, the best test vectors are chosen and then these pairs of vectors are applied to the circuit. Each of these pair of vectors is able to detect a certain number of the faults and the path delay fault coverage for each and all of them may be calculated. Suitable choice of a path may result in the coverage of the whole circuit and increases detected faults. In this paper, a new method for choosing the minimum suitable paths is introduced. Decreasing the number of test paths causes an increase in the number of detectable faults by a certain number of test vector pairs, hence giving a better fault coverage. In the presented method, a test path would be selected, if and only if, there exists at least one "two-piece" segment in that path which has not been tested before in the previously tested paths. If the chosen path has at least one "three-piece" (or "more-piece") segment the method will become more complicated. The method is applied to some ISCAS89 benchmarks circuits. Keywords– Sequential circuit, path delay fault, fault coverage
منابع مشابه
Improving accuracy in path delay fault coverage estimation
A recently published method computes path delay fault coverage from the count of the number of path faults newly sensitized by a simulated vector pair. Such an estimate is pessimistic since several paths may share a set of lines. In this paper, we present a continuum of approximate methods, approaching exact fault simulation, for a tradeoo between accuracy and complexity. Higher accuracy is obt...
متن کاملAn Ecient P Ath Delay F Ault Coverage Estimator
|We propose a linear complexity method to estimate robust path delay fault coverage in digital circuits. We adopt a path counting scheme for a true-value simulator that uses ags for each signal line. These ags determine the new path delay faults detected by the simulated vector pair. Experimental results are presented to show the e ectiveness of the method in estimating path delay fault coverage.
متن کاملImproving a nonenumerative method to estimate path delay fault coverage
A recently proposed method obtains path delay fault coverages by estimating the count of the number of tested faults instead of actually enumerating them. The estimate become pessimistic when several paths share a set of lines. In this communication, we present a continuum of improved approximations for the counting method, approaching exact fault simulation, to allow trade-o s between accuracy...
متن کاملAn Eecient Path Delay Fault Coverage Estimator
Keerthi Heragu Michael L. Bushnell Vishwani D. Agrawal Dept. of Electrical & Computer Eng. Dept. of Electrical & Computer Eng. AT&T Bell Labs Rutgers University Rutgers University 600 Mountain Avenue Piscataway, NJ 08855-0909 Piscataway, NJ 08855-0909 Murray Hill, NJ 07974 [email protected] [email protected] [email protected] Abstract|We propose a linear complexity method to est...
متن کاملCritical Paths Selection for Delay Faults
Extended Abstract Right timing of complex digital circuits and systems in nanotechnology need careful design steps and testing. Incorrect timing can be caused during design or manufacturing processes. Incorrect timing is manifested as delay faults. The delay faults in digital circuit testing are more and more important due to huge number of gates and lines integrated on a chip specifically in n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006